A preliminary empirical comparison of recursive neural networks and tree kernel methods on regression tasks for tree structured domains

نویسندگان

  • Alessio Micheli
  • Filippo Portera
  • Alessandro Sperduti
چکیده

The aim of this paper is to start a comparison between Recursive Neural Networks (RecNN) and kernel methods for structured data, specifically Support Vector Regression (SVR) machine using a Tree Kernel, in the context of regression tasks for trees. Both the approaches can deal directly with a structured input representation and differ in the construction of the feature space from structured data. We present and discuss preliminary empirical results for specific regression tasks involving well-known Quantitative Structure-Activity and Quantitative Structure-Property Relationship (QSAR/QSPR) problems, where both the approaches are able to achieve state-of-the-art results.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A preliminary experimental comparison of recursive neural networks and a tree kernel method for QSAR/QSPR regression tasks

We consider two different methods for QSAR/QSPR regression tasks: Recursive Neural Networks (RecNN) and a Support Vector Regression (SVR) machine using a Tree Kernel. Experimental results on two specific regression tasks involving alkanes and benzodiazepines are obtained for the two approaches.

متن کامل

Wide coverage natural language processing using kernel methods and neural networks for structured data

Convolution kernels and recursive neural networks are both suitable approaches for supervised learning when the input is a discrete structure like a labeled tree or graph. We compare these techniques in two natural language problems. In both problems, the learning task consists in choosing the best alternative tree in a set of candidates. We report about an empirical evaluation between the two ...

متن کامل

TreeESN: a Preliminary Experimental Analysis

In this paper we introduce an efficient approach to Recursive Neural Networks (RecNNs) modeling, the Tree Echo State Network (TreeESN), extending the Echo State Network (ESN) model from sequential to tree structured domains processing. For structure-to-element transductions, the state mapping (i.e. the way in which the state values for the whole structure are selected/collected) turns out to ha...

متن کامل

Tree-Structured Composition in Neural Networks without Tree-Structured Architectures

Tree-structured neural networks encode a particular tree geometry for a sentence in the network design. However, these models have at best only slightly outperformed simpler sequence-based models. We hypothesize that neural sequence models like LSTMs are in fact able to discover and implicitly use recursive compositional structure, at least for tasks with clear cues to that structure in the dat...

متن کامل

DIFFERENT NEURAL NETWORKS AND MODAL TREE METHOD FOR PREDICTING ULTIMATE BEARING CAPACITY OF PILES

The prediction of the ultimate bearing capacity of the pile under axial load is one of the important issues for many researches in the field of geotechnical engineering. In recent years, the use of computational intelligence techniques such as different methods of artificial neural network has been developed in terms of physical and numerical modeling aspects. In this study, a database of 100 p...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Neurocomputing

دوره 64  شماره 

صفحات  -

تاریخ انتشار 2005